E-Chord: Keyword-Based Search Algorithm Based on DHT in Mediation Architecture
نویسندگان
چکیده
E-Chord is a Distributed Hash Table algorithm (DHT) inspired from Chord, Pastry and CAN algorithms. It meant to provide a keyword-based search in the Three-Layer Mediation Architecture. The E-Chord is deployed in the middle layer (Integration Layer) of the architecture and provides services to the higher layer (Presence Layer) and the lower layer (Homogenization Layer).
منابع مشابه
KEYNOTE: Keyword Search by Node Selection for Text Retrieval on DHT-Based P2P Networks
Efficient full-text keyword search remains a challenging problem in P2P systems. Most of the traditional keyword search systems on DHT overlay networks perform the join operation of keywords at document level, which consumes a huge amount of storage and bandwidth cost. In this paper, we present KEYNOTE, a novel keyword search system that performs the join operation at node level. Compared to th...
متن کاملImplementing Dynamic Querying Search in k-ary DHT-based Overlays
Distributed Hash Tables (DHTs) provide scalable mechanisms for implementing resource discovery services in structured Peer-to-Peer (P2P) networks. However, DHT-based lookups do not support some types of queries which are fundamental in several classes of applications. A way to support arbitrary queries in structured P2P networks is implementing unstructured search techniques on top of DHT-based...
متن کاملMagnolia: A novel DHT Architecture for Keyword-based Searching
The class of DHT-based P2P systems like Chord, Pastry, Tapestry, Kademlia greatly improve over unstructured P2P systems like Gnutella and Kazaa by providing (1) Scalable and efficient O(log(n)) lookup and routing for any document (2) Good load balancing properties for very large number of keys or documents. However, to lookup a document, its complete initial identifier must be known to compute ...
متن کاملAn Effective Path-aware Approach for Keyword Search over Data Graphs
Abstract—Keyword Search is known as a user-friendly alternative for structured languages to retrieve information from graph-structured data. Efficient retrieving of relevant answers to a keyword query and effective ranking of these answers according to their relevance are two main challenges in the keyword search over graph-structured data. In this paper, a novel scoring function is proposed, w...
متن کاملDistributed Suffix Tree for Peer-to-Peer Search
Establishing an appropriate semantic overlay on Peer-to-Peer networks to obtain both semantic ability and scalability is a challenge. Current DHT-based P2P networks are limited in their ability to support semantic search. This paper proposes the DST (Distributed Suffix Tree) overlay as the intermediate layer between the DHT overlay and the semantic overlay. The DST overlay supports search of ke...
متن کامل